Skip to content

Latest commit

 

History

History
63 lines (52 loc) · 2.32 KB

README.md

File metadata and controls

63 lines (52 loc) · 2.32 KB

1023. Camelcase Matching

Given an array of strings queries and a string pattern, return a boolean array answer where answer[i] is true if queries[i] matches pattern, and false otherwise.

A query word queries[i] matches pattern if you can insert lowercase English letters pattern so that it equals the query. You may insert each character at any position and you may not insert any characters.

Example 1:

Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB" Output: [true,false,true,true,false] Explanation: "FooBar" can be generated like this "F" + "oo" + "B" + "ar". "FootBall" can be generated like this "F" + "oot" + "B" + "all". "FrameBuffer" can be generated like this "F" + "rame" + "B" + "uffer".

Example 2:

Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa" Output: [true,false,true,false,false] Explanation: "FooBar" can be generated like this "Fo" + "o" + "Ba" + "r". "FootBall" can be generated like this "Fo" + "ot" + "Ba" + "ll".

Example 3:

Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT" Output: [false,true,false,false,false] Explanation: "FooBarTest" can be generated like this "Fo" + "o" + "Ba" + "r" + "T" + "est".

Constraints:

  • 1 <= pattern.length, queries.length <= 100
  • 1 <= queries[i].length <= 100
  • queries[i] and pattern consist of English letters.

Solutions (Rust)

1. Solution

implSolution{pubfncamel_match(queries:Vec<String>,pattern:String) -> Vec<bool>{let pattern = pattern.as_bytes();letmut ret = vec![true; queries.len()];for i in0..queries.len(){let query = queries[i].as_bytes();letmut j = 0;for k in0..query.len(){if j < pattern.len() && query[k] == pattern[j]{ j += 1;}elseif query[k].is_ascii_uppercase(){ ret[i] = false;break;}} ret[i] &= j == pattern.len();} ret }}
close